Incremental cluster-based retrieval using compressed cluster-skipping inverted files
نویسندگان
چکیده
منابع مشابه
Algorithms for Within-Cluster Searches Using Inverted Files
Information retrieval over clustered document collections has two successive stages: first identifying the best-clusters and then the best-documents in these clusters that are most similar to the user query. In this paper, we assume that an inverted file over the entire document collection is used for the latter stage. We propose and evaluate algorithms for within-cluster searches, i.e., to int...
متن کاملIncremental Transitivity Applied to Cluster Retrieval
Many problems have emerged while building accurate and efficient clusters of documents; such as the inherent problems of the similarity measure, and document logical view modeling. This research is an attempt to minimize the effect of these problems by using a new definition of transitive relevance between documents; i.e., adding more conditions on transitive relevance judgment through incremen...
متن کاملCluster-based patent retrieval
Through the recent NTCIR workshops, patent retrieval casts many challenging issues to information retrieval community. Unlike newspaper articles, patent documents are very long and well structured. These characteristics raise the necessity to reassess existing retrieval techniques that have been mainly developed for structure-less and short documents such as newspapers. This study investigates ...
متن کاملCluster-Based Image Segmentation Using Fuzzy Markov Random Field
Image segmentation is an important task in image processing and computer vision which attract many researchers attention. There are a couple of information sets pixels in an image: statistical and structural information which refer to the feature value of pixel data and local correlation of pixel data, respectively. Markov random field (MRF) is a tool for modeling statistical and structural inf...
متن کاملEfficient Compressed Inverted Index Skipping for Disjunctive Text-Queries
In this paper we look at a combination of bulk-compression, partial query processing and skipping for document-ordered inverted indexes. We propose a new inverted index organization, and provide an updated version of the MaxScore method by Turtle and Flood and a skipping-adapted version of the space-limited adaptive pruning method by Lester et al. Both our methods significantly reduce the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Information Systems
سال: 2008
ISSN: 1046-8188,1558-2868
DOI: 10.1145/1361684.1361688